Generic Schema Matching With Cupid Jayant Madhavan
نویسنده
چکیده
ACM Trans. Database Syst. 30(2), 2005, 624-660. PDF, Jayant Madhavan, Philip A. Bernstein, Erhard Rahm Generic Schema Matching with Cupid VLDB'01 fragment research considering keith fixed jayant survey EVALUATION application 425 van 77–94 key matching printed christian errorm molina likelihood dynamic following arrow parent data madhavan heuristic strategie staab quantitative yanni recall 1000 schema reasonable identifier convergence OF summative. lies in providing a generic mapping approach to address schema interoperability and study of the various tools implemented in the literature for schema matching, including. Cupid (MBR01), Clio (HMH01), Protoplasm (BMP+04) and COMA++ (AMD+05) (BMR11) Bernstein, Philip A., Jayant Madhavan, and Erhard Rahm. Abstract: In schema and ontology matching, background knowledge such as dictionaries and thesauri Many generic match strategies have (MBDH05) Jayant Madhavan, Philip A. Bernstein, AnHai Doan, and Alon Halevy. Corpus-Based. System ×, Model Management ×, Object-oriented Database ×, Database Schema × Generic Schema Matching, Ten Years Later. Jayant Madhavan.
منابع مشابه
Generic Schema Matching with Cupid
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid...
متن کاملGeneric Schema Matching, Ten Years Later
In a paper published in the 2001 VLDB Conference, we proposed treating generic schema matching as an independent problem. We developed a taxonomy of existing techniques, a new schema matching algorithm, and an approach to comparative evaluation. Since then, the field has grown into a major research topic. We briefly summarize the new techniques that have been developed and applications of the t...
متن کاملA Semi Automatic Tool For Schema Mapping
neric mapping framework at the schema level to address the problem of schema interoperability Providing a formalism for developing a generic, extensible, and semi-automated mapping A semi-automatic tool for schema mapping. at the University of Washington in Seattle, where he founded the database group. on Clio, the first semi-automatic tool for heterogeneous schema mapping. Keywords: data integ...
متن کاملSchemr: a Schema Search Engine for Information Integration
Schemr is a schema search engine, and provides users the ability to search for and visualize schemas stored in a metadata repository. Users may search by keywords and by example – using schema fragments as query terms. Schemr uses a novel search algorithm, based on a combination of text search and schema matching techniques, as well as a structurally-aware scoring metric. Schemr presents search...
متن کاملA Unified Schema Matching Framework
The proliferation of applications dealing with shared data radically increases the need to identify and discover the semantically corresponding elements. To cope with the difficulties of the necessary schema matching, we propose a unified framework. The framework tries to collect the most well-known work concerning schema matching in a generalized approach. We observe that nearly all of this wo...
متن کامل